A Fast and Compact FPGA Implementation of Elliptic Curve Cryptography Using Lambda Coordinates

نویسندگان

  • Burak Gövem
  • Kimmo Järvinen
  • Kris Aerts
  • Ingrid Verbauwhede
  • Nele Mentens
چکیده

Elliptic curve cryptography (ECC) provides high security with shorter keys than other public-key cryptosystems and it has been successfully used in security critical embedded systems. We present an FPGA-based coprocessor that communicates with the host processor via a 32-bit bus. It implements ECC over an elliptic curve that offers roughly 128-bit security. It is the first hardware implementation that uses the recently introduced lambda coordinates and the Galbraith-Lin-Scott (GLS) technique with fast endomorphisms. One scalar multiplication requires 65,000 clock cycles with a maximum clock frequency of 274 MHz on a Xilinx Virtex-5 FPGA, which gives a computation time of 0.24 ms. The area utilization is 1552 slices and 4 BlockRAMs. Our coprocessor compares favorably to other published works both in terms of speed and area, which makes it a good choice for embedded systems that require high-security public-key cryptography.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

A Single Formula and its Implementation in FPGA for Elliptic Curve Point Addition Using Affine Representation

A formula for point addition in elliptic curves using a±ne representation and its implementation in FPGA is presented. The use of this new formula in hardware implementations of scalar multiplications for elliptic curve cryptography has the main advantages of: (i) reducing area for the implementations of elliptic curve point addition, and (ii) increasing the resistance to side channel attacks o...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

An FPGA implementation of elliptic curve cryptography for future secure web transaction

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So it would be more attractive to implement this unit using hardware than using software. In this pa...

متن کامل

VHDL Implementation using Elliptic Curve Point Multiplication

This paper describes synthesizable VDHL implementation of elliptic curve Point Multiplication. Elliptic curves used for ECC are defined over mathematical structures called Galois fields. Based on the theory of ECC, this paper has carried out Modular addition/subtraction, EC Point doubling/addition, Modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016